#include <cstdio>
#include <algorithm>
using namespace std;
//设f(a,b)为a横b竖时先手的胜负情况，1为胜，0为负
//由题意可知f(a,b)=~f(a-1,b-1)  且f(0,b)=f(a,0)=0
//简单打表可知判断min(n,m)奇偶即可
int main(void){
    int n,m;
    scanf("%d%d",&n,&m);
    if(min(n,m)%2){
        printf("Akshat\n");
    }
    else{
        printf("Malvika\n");
    }
    return 0;
}